Index Sets of some Computable Groups

نویسنده

  • Abigail Raz
چکیده

1 Acknowledgements I would first like to thank my advisor Professor Karen Lange. She has quite literally taught me everything I know about computability. She has helped me develop as not only a math researcher, but also a writer and presenter. I would also like to thank NSF grant DMS-1100604 for funding summer research that was instrumental in helping me complete this thesis. I would also like to thank my entire thesis committee, Professor Diesl and Professor Shuchat of the math department and Professor McGowan of the philosophy department. Special thanks to Professor Diesl for meeting with me multiple times this semester to discuss my thesis research. In addition, I would like to thank all of my professors in the Wellesley math department for sharing with me their knowledge and passion for math. I also have to thank all of my amazing friends in the math department for their constant support throughout this process, and for the past four years. Together we have made it through seemingly endless problem sets and our transitions to the world of math research. Finally, I would like to thank all of my friends and family who have shaped my time here at Wellesley. Thanks to my father who first inspired my love of math, and my mother and sister who have consistently supported me and put up with all of my math talk. Thanks to all of my amazing Wellesley friends without whom my time at Wellesley would be unrecognizable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Index Sets of Computable Structures

The index set of a computable structure A is the set of indices for computable copies of A. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary finite structures, Q-vector spaces, Archimedean real closed ordered fields, reduced Abelian p-groups of length less than ω, and models of the original Ehrenfeucht theory. The index sets for...

متن کامل

Index sets for computable differential equations

dx = F (x, y) and the wave equation from the point of view of index sets. Index sets play an important role in the study of computable functions and computably enumerable sets (see, for example, Soare [21]) . Index sets for computable combinatorics have been studied by Gasarch and others [8, 9]; the latter paper provides a survey of such results. Index sets for Π1 classes were developed by the ...

متن کامل

Index sets and parametric reductions

We investigate the index sets associated with the degree structures of computable sets under the parameterized reducibilities introduced by the authors. We solve a question of Peter Cholak and the first author by proving the fundamental index sets associated with a computable set A, {e : We ≤q A} for q ∈ {m, T } are 0 4 complete. We also show that FPT (≤q), that is {e : We computable and ≡q ∅},...

متن کامل

Describing free groups

We consider countable free groups of different ranks. For these groups, we investigate computability theoretic complexity of index sets within the class of free groups and within the class of all groups. For a computable free group of infinite rank, we consider the difficulty of finding a basis.

متن کامل

There Is No Classification of the Decidably Presentable Structures

A computable structure A is decidable if, given a formula φ(x̄) of elementary first-order logic, and a tuple ā ∈ A, we have a decision procedure to decide whether φ holds of ā. We show that there is no reasonable classification of the decidably presentable structures. Formally, we show that the index set of the computable structures with decidable presentations is Σ1-complete. This result holds ...

متن کامل

Computing in the Limit

We define a class of functions termed " Computable in the Limit " , based on the Machine Learning paradigm of " Identification in the Limit ". A function is Computable in the Limit if it defines a property Pp of a recursively enumerable class A of recursively enumerable data sequences S ∈ A, such that each data sequence S is generated by a total recursive function φs that enumerates S. Let the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014